Büchi-Kamp Theorems for 1-clock ATA
نویسندگان
چکیده
This paper investigates Kamp-like and Büchi-like theorems for 1-clock Alternating Timed Automata (1-ATA) and its natural subclasses. A notion of 1-ATA with loop-free-resets is defined. This automaton class is shown to be expressively equivalent to the temporal logic RatMTL which is MTL[FI] extended with a regular expression guarded modality. Moreover, a subclass of future timed MSO with k-variable-connectivity property is introduced as logic QkMSO. In a Kamp-like result, it is shown that RatMTL is expressively equivalent to QkMSO. As our second result, we define a notion of conjunctive-disjunctive 1-clock ATA (C⊕D 1-ATA). We show that C⊕D 1-ATA with loop-free-resets are expressively equivalent to the sublogic FRatMTL of RatMTL. Moreover FRatMTL is expressively equivalent to Q2MSO, the two-variable connected fragment of QkMSO. The full class of 1-ATA is shown to be expressively equivalent to RatMTL extended with fixed point operators.
منابع مشابه
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words
We prove that there exist some 1-counter Büchi automata An for which some elementary properties are independent of theories like Tn =: ZFC + “There exist (at least) n inaccessible cardinals”, for integers n ≥ 1. In particular, if Tn is consistent, then “L(An) is Borel”, “L(An) is arithmetical”, “L(An) is ω-regular”, “L(An) is deterministic”, and “L(An) is unambiguous” are provable from ZFC + “T...
متن کاملEfficient Emptiness Check for Timed Büchi Automata
The Büchi non-emptiness problem for timed automata concerns deciding if a given automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The standard solution to this problem involves adding an auxiliary clock to take care of the non-Zenoness. In this paper, we show that this simple transformation may sometimes result in an exponential blowup. We propose a method avoidin...
متن کاملDecomposition Theorems for Probabilistic Automata over Infinite Objects
A probabilistic Büchi automaton PBA is defined. The probabilistic language (L, p) as defined by the PBA is defined. A decomposition theorem similar to the classical Krohn-Rhodes theorem, but for PBA is proved.
متن کاملOn Timed Automata with Discrete Time - Structural and Language Theoretical Characterization
We develop a structural and language theoretical characterization of timed languages over discrete time in terms of a variant of Büchi automata and languages. The so-called tick automaton is a standard Büchi automaton with a special “clock-tick”-input symbol modeling the discrete flow of time. Based on these characterizations we give an alternative proof for the fact that the class of regular t...
متن کاملDecidability of Emptiness Checking in various Alternating Timed Automata and Connections to Timed Logics
In the initial parts of this thesis, we start by approaching the problem of decidability of emptiness of one variable alternating stopwatch automata. We start off by presenting an overview of important results in the field of hybrid systems and useful subclasses and their proofs. Then we go on to alternating timed automata and redo the previously known result that one clock ATA has decidable la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.02514 شماره
صفحات -
تاریخ انتشار 2018